#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=20;
typedef int LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],p[maxn];
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL n,x,y;cin>>n>>x>>y;
    for(int i=1;i<=n;i++) cin>>a[i];
    LL m;cin>>m;
    for(int i=1;i<=m;i++) cin>>p[i];
    int l=x-1;int r=x+1;
    int id=1;
    int ans=0;
    while(id<=m){
        if(a[l]==a[r]&&a[l]==p[id]){
            id++;l--;r++;
            continue;
        }
        else if(a[l]==p[id]&&x<y){
            ans=-1;break;
        }
        else if(a[l]==p[id]&&x>y){
            ans=1;break;
        }
        else if(a[r]==p[id]&&x<y){
            ans=1;break;
        }
        else if(a[r]==p[id]&&x>y){
            ans=-1;break;
        }
    }
    if(ans==-1){
        cout<<"Wrong"<<endl;
    }
    else if(ans==1){
        cout<<"Right"<<endl;
    }
    else{
        cout<<"Unsure"<<endl;
    }
   	return 0;
}
